A new algebraic invariant for weak equivalence of sofic subshifts
نویسندگان
چکیده
It is studied how taking the inverse image by a sliding block code affects the syntactic semigroup of a sofic subshift. Two independent approaches are used: ζ-semigroups as recognition structures for sofic subshifts, and relatively free profinite semigroups. A new algebraic invariant is obtained for weak equivalence of sofic subshifts, by determining which classes of sofic subshifts naturally defined by pseudovarieties of finite semigroups are closed under weak equivalence. Among such classes are the classes of almost finite type subshifts and aperiodic subshifts. The algebraic invariant is compared with other robust conjugacy invariants.
منابع مشابه
Conjugacy Invariants of Subshifts: an Approach from Profinite Semigroup Theory
It is given a structural conjugacy invariant in the set of pseudowords whose finite factors are factors of a given subshift. Some profinite semigroup tools are developed for this purpose. With these tools a shift equivalence invariant of sofic subshifts is obtained, improving an invariant introduced by Béal, Fiorenzi and Perrin using different techniques. This new invariant is used to prove tha...
متن کاملAlgorithmic Complexity for the Realization of an Effective Subshift By a Sofic
Realization of d-dimensional effective subshifts as projective sub-actions of d + d′-dimensional sofic subshifts for d′ ≥ 1 is now well known [6, 4, 2]. In this paper we are interested in qualitative aspects of this realization. We introduce a new topological conjugacy invariant for effective subshifts, the speed of convergence, in view to exhibit algorithmic properties of these subshifts in co...
متن کاملTEL-AVIV UNIVERSITY RAYMOND AND BEVERLY SACKLER FACULTY OF EXACT SCIENCES SCHOOL OF MATHEMATICAL SCIENCES Tail Invariant Measures of The Dyck-Shift and Non-Sofic Systems
Among the most familiar systems in symbolic dynamics are the subshifts of finite type, or SFT’s for short. SFT’s are relatively easy to analyze, and have many pleasant properties such as intrinsic ergodicity and unique ergodicity with respect to the tail. A larger class, which has the desirable property of being closed under factors, is that of sofic systems. This class of systems retains many ...
متن کاملThe Syntactic Graph of a Sofic Shift Is Invariant under Shift Equivalence
We define a new invariant for shift equivalence of sofic shifts. This invariant, that we call the syntactic graph of a sofic shift, is the directed acyclic graph of characteristic groups of the non null regular D-classes of the syntactic semigroup of the shift.
متن کاملPseudovarieties Defining Classes of Sofic Subshifts Closed for Taking Shift Equivalent Subshifts
For a pseudovariety V of ordered semigroups, let S (V) be the class of sofic subshifts whose syntactic semigroup lies in V. It is proved that if V contains Sl− then S (V∗D) is closed for taking shift equivalent subshifts, and conversely, if S (V) is closed for taking conjugate subshifts then V contains LSl− and S (V) = S (V∗D). Almost finite type subshifts are characterized as the irreducible e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- ITA
دوره 42 شماره
صفحات -
تاریخ انتشار 2008